منابع مشابه
Tight Pounds on Oblivious Chaining
The chaining problem is deened as follows. = maxfj j a j = 1; j < ig. (Deene maxfg = 0) The chaining problem appears as a subproblem in many contexts. There are algorithms known that solve the chaining problem on CRCW PRAMs in O((n)) time, where (n) is the inverse of Ackerman's function, and is a very slowly growing function. We study a class of algorithms (called oblivious algorithms) for this...
متن کاملWords Made Flesh
Executable code existed centuries before the invention of the computer in magic, Kabbalah, musical composition and experimental poetry. These practices are often neglected as a historical pretext of contemporary software culture and electronic arts. Above all, they link computations to a vast speculative imagination that encompasses art, language, technology, philosophy and religion. These spec...
متن کاملResurrection of the Flesh-body
There are a few statements in Scripture which are often adduced as indisputable evidence that we cannot expect a resurrection of this body of flesh. Outstanding among these statements is in the first place Paul's re,. mark in 1 Cor. 15 : 50a: ''Now this I say, brethren, that flesh and blood can,. not inherit the kingdom of God.''' Already in the early Churcb all who denied the resurrection of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1986
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.293.6559.1427